0.10/0.11 % Problem : SLH416^1 : TPTP v7.5.0. Released v7.5.0. 0.10/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n029.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 30 0.12/0.33 % WCLimit : 30 0.12/0.33 % DateTime : Tue Aug 9 03:05:54 EDT 2022 0.12/0.33 % CPUTime : 0.19/0.45 The problem SPC is TH0_THM_EQU_NAR 0.19/0.45 Running higher-order on 1 cores theorem proving 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.45 # Version: 3.0pre003-ho 0.19/0.53 # Preprocessing class: HSLSSMSMSSMCHFA. 0.19/0.53 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.19/0.53 # Starting full_lambda_5 with 30s (1) cores 0.19/0.53 # full_lambda_5 with pid 17247 completed with status 0 0.19/0.53 # Result found by full_lambda_5 0.19/0.53 # Preprocessing class: HSLSSMSMSSMCHFA. 0.19/0.53 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.19/0.53 # Starting full_lambda_5 with 30s (1) cores 0.19/0.53 # No SInE strategy applied 0.19/0.53 # Search class: HGHSM-FSLM32-DHFFFSBN 0.19/0.53 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.19/0.53 # Starting new_ho_10 with 17s (1) cores 0.19/0.53 # new_ho_10 with pid 17248 completed with status 0 0.19/0.53 # Result found by new_ho_10 0.19/0.53 # Preprocessing class: HSLSSMSMSSMCHFA. 0.19/0.53 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.19/0.53 # Starting full_lambda_5 with 30s (1) cores 0.19/0.53 # No SInE strategy applied 0.19/0.53 # Search class: HGHSM-FSLM32-DHFFFSBN 0.19/0.53 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.19/0.53 # Starting new_ho_10 with 17s (1) cores 0.19/0.53 # Preprocessing time : 0.008 s 0.19/0.53 # Presaturation interreduction done 0.19/0.53 0.19/0.53 # Proof found! 0.19/0.53 # SZS status Theorem 0.19/0.53 # SZS output start CNFRefutation 0.19/0.53 thf(decl_22, type, plus_plus_multiset_a: multiset_a > multiset_a > multiset_a). 0.19/0.53 thf(decl_23, type, zero_zero_multiset_a: multiset_a). 0.19/0.53 thf(decl_24, type, nO_MAT1617603563iset_a: multiset_a > multiset_a > $o). 0.19/0.53 thf(decl_25, type, heapIm1140443833left_a: tree_a > tree_a). 0.19/0.53 thf(decl_26, type, heapIm1257206334ight_a: tree_a > tree_a). 0.19/0.53 thf(decl_27, type, heapIm1091024090Down_a: tree_a > tree_a). 0.19/0.53 thf(decl_28, type, e_a: tree_a). 0.19/0.53 thf(decl_29, type, t_a: a > tree_a > tree_a > tree_a). 0.19/0.53 thf(decl_30, type, rel_Tree_a_a: (a > a > $o) > tree_a > tree_a > $o). 0.19/0.53 thf(decl_31, type, in_tree_a: a > tree_a > $o). 0.19/0.53 thf(decl_32, type, is_heap_a: tree_a > $o). 0.19/0.53 thf(decl_33, type, multiset_a2: tree_a > multiset_a). 0.19/0.53 thf(decl_34, type, val_a: tree_a > a). 0.19/0.53 thf(decl_35, type, lattic146396397_Max_a: set_a > a). 0.19/0.53 thf(decl_36, type, add_mset_a: a > multiset_a > multiset_a). 0.19/0.53 thf(decl_37, type, comm_m315775925iset_a: (multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a). 0.19/0.53 thf(decl_38, type, fold_m382157835iset_a: (multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a). 0.19/0.53 thf(decl_39, type, fold_m364285649iset_a: (a > multiset_a > multiset_a) > multiset_a > multiset_a > multiset_a). 0.19/0.53 thf(decl_40, type, image_929116801iset_a: (a > multiset_a) > multiset_a > multiset_multiset_a). 0.19/0.53 thf(decl_41, type, image_mset_a_a: (a > a) > multiset_a > multiset_a). 0.19/0.53 thf(decl_42, type, mult1_a: set_Product_prod_a_a > set_Pr158363655iset_a). 0.19/0.53 thf(decl_43, type, mult_a: set_Product_prod_a_a > set_Pr158363655iset_a). 0.19/0.53 thf(decl_44, type, set_mset_multiset_a: multiset_multiset_a > set_multiset_a). 0.19/0.53 thf(decl_45, type, set_mset_a: multiset_a > set_a). 0.19/0.53 thf(decl_46, type, subseteq_mset_a: multiset_a > multiset_a > $o). 0.19/0.53 thf(decl_47, type, ord_less_eq_o_o_a: ($o > $o > a) > ($o > $o > a) > $o). 0.19/0.53 thf(decl_48, type, ord_less_eq_o_a: ($o > a) > ($o > a) > $o). 0.19/0.53 thf(decl_49, type, ord_le1530450702ee_a_o: (tree_a > tree_a > $o) > (tree_a > tree_a > $o) > $o). 0.19/0.53 thf(decl_50, type, ord_less_eq_a_a_o: (a > a > $o) > (a > a > $o) > $o). 0.19/0.53 thf(decl_51, type, ord_le1199012836iset_a: multiset_a > multiset_a > $o). 0.19/0.53 thf(decl_52, type, ord_less_eq_set_a: set_a > set_a > $o). 0.19/0.53 thf(decl_53, type, ord_less_eq_a: a > a > $o). 0.19/0.53 thf(decl_54, type, order_Greatest_o_a: (($o > a) > $o) > $o > a). 0.19/0.53 thf(decl_55, type, order_Greatest_a: (a > $o) > a). 0.19/0.53 thf(decl_56, type, produc2037245207iset_a: multiset_a > multiset_a > produc1127127335iset_a). 0.19/0.53 thf(decl_57, type, product_Pair_a_a: a > a > product_prod_a_a). 0.19/0.53 thf(decl_58, type, irrefl_a: set_Product_prod_a_a > $o). 0.19/0.53 thf(decl_59, type, trans_a: set_Product_prod_a_a > $o). 0.19/0.53 thf(decl_60, type, collect_a: (a > $o) > set_a). 0.19/0.53 thf(decl_61, type, member_multiset_a: multiset_a > set_multiset_a > $o). 0.19/0.53 thf(decl_62, type, member340150864iset_a: produc1127127335iset_a > set_Pr158363655iset_a > $o). 0.19/0.53 thf(decl_63, type, member449909584od_a_a: product_prod_a_a > set_Product_prod_a_a > $o). 0.19/0.53 thf(decl_64, type, member_a: a > set_a > $o). 0.19/0.53 thf(decl_65, type, l: tree_a). 0.19/0.53 thf(decl_66, type, l1: tree_a). 0.19/0.53 thf(decl_67, type, l2: tree_a). 0.19/0.53 thf(decl_68, type, la: tree_a). 0.19/0.53 thf(decl_69, type, r: tree_a). 0.19/0.53 thf(decl_70, type, r1: tree_a). 0.19/0.53 thf(decl_71, type, r2: tree_a). 0.19/0.53 thf(decl_72, type, ra: tree_a). 0.19/0.53 thf(decl_73, type, t: tree_a). 0.19/0.53 thf(decl_74, type, v: a). 0.19/0.53 thf(decl_75, type, v1: a). 0.19/0.53 thf(decl_76, type, v2: a). 0.19/0.53 thf(decl_77, type, v3: a). 0.19/0.53 thf(decl_78, type, va: a). 0.19/0.53 thf(decl_79, type, esk1_0: tree_a). 0.19/0.53 thf(decl_80, type, esk2_0: a). 0.19/0.53 thf(decl_81, type, esk3_0: tree_a). 0.19/0.53 thf(decl_82, type, esk4_2: tree_a > a > tree_a). 0.19/0.53 thf(decl_83, type, esk5_2: tree_a > a > a). 0.19/0.53 thf(decl_84, type, esk6_2: tree_a > a > tree_a). 0.19/0.53 thf(decl_85, type, esk7_1: tree_a > a). 0.19/0.53 thf(decl_86, type, esk8_1: tree_a > a). 0.19/0.53 thf(decl_87, type, esk9_1: tree_a > a). 0.19/0.53 thf(decl_88, type, esk10_1: tree_a > tree_a). 0.19/0.53 thf(decl_89, type, esk11_1: tree_a > tree_a). 0.19/0.53 thf(decl_90, type, esk12_1: tree_a > a). 0.19/0.53 thf(decl_91, type, esk13_1: tree_a > a). 0.19/0.53 thf(decl_92, type, esk14_1: tree_a > tree_a). 0.19/0.53 thf(decl_93, type, esk15_1: tree_a > tree_a). 0.19/0.53 thf(decl_94, type, esk16_1: tree_a > a). 0.19/0.53 thf(decl_95, type, esk17_1: tree_a > a). 0.19/0.53 thf(decl_96, type, esk18_1: tree_a > tree_a). 0.19/0.53 thf(decl_97, type, esk19_1: tree_a > tree_a). 0.19/0.53 thf(decl_98, type, esk20_1: tree_a > a). 0.19/0.53 thf(decl_99, type, esk21_1: tree_a > tree_a). 0.19/0.53 thf(decl_100, type, esk22_1: tree_a > tree_a). 0.19/0.53 thf(decl_101, type, esk23_1: tree_a > a). 0.19/0.53 thf(decl_102, type, esk24_1: tree_a > a). 0.19/0.53 thf(decl_103, type, esk25_1: tree_a > a). 0.19/0.53 thf(decl_104, type, esk26_1: tree_a > tree_a). 0.19/0.53 thf(decl_105, type, esk27_1: tree_a > tree_a). 0.19/0.53 thf(decl_106, type, esk28_1: tree_a > a). 0.19/0.53 thf(decl_107, type, esk29_1: tree_a > a). 0.19/0.53 thf(decl_108, type, esk30_1: tree_a > tree_a). 0.19/0.53 thf(decl_109, type, esk31_1: tree_a > tree_a). 0.19/0.53 thf(decl_110, type, esk32_1: tree_a > a). 0.19/0.53 thf(decl_111, type, esk33_1: tree_a > a). 0.19/0.53 thf(decl_112, type, esk34_1: tree_a > tree_a). 0.19/0.53 thf(decl_113, type, esk35_1: tree_a > tree_a). 0.19/0.53 thf(decl_114, type, esk36_1: tree_a > a). 0.19/0.53 thf(decl_115, type, esk37_1: tree_a > tree_a). 0.19/0.53 thf(decl_116, type, esk38_1: tree_a > tree_a). 0.19/0.53 thf(decl_117, type, esk39_1: tree_a > a). 0.19/0.53 thf(decl_118, type, esk40_1: tree_a > tree_a). 0.19/0.53 thf(decl_119, type, esk41_1: tree_a > tree_a). 0.19/0.53 thf(decl_120, type, esk42_1: (tree_a > $o) > a). 0.19/0.53 thf(decl_121, type, esk43_1: (tree_a > $o) > tree_a). 0.19/0.53 thf(decl_122, type, esk44_1: (tree_a > $o) > tree_a). 0.19/0.53 thf(decl_123, type, epred1_2: ($o > a) > ($o > a) > $o). 0.19/0.53 thf(decl_124, type, esk45_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_125, type, esk46_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_126, type, esk47_4: ($o > a) > (a > $o > a) > a > a > a). 0.19/0.53 thf(decl_127, type, esk48_4: ($o > a) > (a > $o > a) > a > a > a). 0.19/0.53 thf(decl_128, type, esk49_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_129, type, esk50_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_130, type, esk51_4: a > (a > a) > a > a > a). 0.19/0.53 thf(decl_131, type, esk52_4: a > (a > a) > a > a > a). 0.19/0.53 thf(decl_132, type, esk53_4: a > a > (a > $o > a) > ($o > a) > a). 0.19/0.53 thf(decl_133, type, esk54_4: a > a > (a > $o > a) > ($o > a) > a). 0.19/0.53 thf(decl_134, type, esk55_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.19/0.53 thf(decl_135, type, esk56_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.19/0.53 thf(decl_136, type, esk57_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_137, type, esk58_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_138, type, esk59_4: a > a > (a > a) > a > a). 0.19/0.53 thf(decl_139, type, esk60_4: a > a > (a > a) > a > a). 0.19/0.53 thf(decl_140, type, esk61_4: ($o > a) > (a > $o > a) > a > a > a). 0.19/0.53 thf(decl_141, type, esk62_4: ($o > a) > (a > $o > a) > a > a > a). 0.19/0.53 thf(decl_142, type, esk63_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_143, type, esk64_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_144, type, esk65_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_145, type, esk66_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_146, type, esk67_4: a > (a > a) > a > a > a). 0.19/0.53 thf(decl_147, type, esk68_4: a > (a > a) > a > a > a). 0.19/0.53 thf(decl_148, type, esk69_1: (a > a > $o) > a). 0.19/0.53 thf(decl_149, type, esk70_1: (a > a > $o) > a). 0.19/0.53 thf(decl_150, type, esk71_1: (a > a > $o) > a). 0.19/0.53 thf(decl_151, type, esk72_1: (a > a > $o) > a). 0.19/0.53 thf(decl_152, type, esk73_4: a > a > (a > $o > a) > ($o > a) > a). 0.19/0.53 thf(decl_153, type, esk74_4: a > a > (a > $o > a) > ($o > a) > a). 0.19/0.53 thf(decl_154, type, esk75_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.19/0.53 thf(decl_155, type, esk76_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.19/0.53 thf(decl_156, type, esk77_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_157, type, esk78_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.19/0.53 thf(decl_158, type, esk79_4: a > a > (a > a) > a > a). 0.19/0.53 thf(decl_159, type, esk80_4: a > a > (a > a) > a > a). 0.19/0.53 thf(decl_160, type, esk81_2: (($o > a) > $o) > ($o > a) > $o > a). 0.19/0.53 thf(decl_161, type, esk82_2: (a > $o) > a > a). 0.19/0.53 thf(decl_162, type, esk83_2: (($o > a) > $o) > ($o > a) > $o > a). 0.19/0.53 thf(decl_163, type, esk84_3: (($o > a) > $o) > ($o > a) > (($o > a) > $o) > $o > a). 0.19/0.53 thf(decl_164, type, esk85_2: (a > $o) > a > a). 0.19/0.53 thf(decl_165, type, esk86_3: (a > $o) > a > (a > $o) > a). 0.19/0.53 thf(decl_166, type, esk87_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > a). 0.19/0.53 thf(decl_167, type, esk88_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.19/0.53 thf(decl_168, type, esk89_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.19/0.53 thf(decl_169, type, esk90_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > a). 0.19/0.53 thf(decl_170, type, esk91_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.19/0.53 thf(decl_171, type, esk92_4: (a > a > $o) > tree_a > tree_a > (tree_a > tree_a > $o) > tree_a). 0.19/0.53 thf(decl_172, type, esk93_1: (a > a > $o) > a). 0.19/0.53 thf(decl_173, type, esk94_3: (a > a > $o) > tree_a > tree_a > a). 0.19/0.53 thf(decl_174, type, esk95_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.19/0.53 thf(decl_175, type, esk96_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.19/0.53 thf(decl_176, type, esk97_3: (a > a > $o) > tree_a > tree_a > a). 0.19/0.53 thf(decl_177, type, esk98_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.19/0.53 thf(decl_178, type, esk99_3: (a > a > $o) > tree_a > tree_a > tree_a). 0.19/0.53 thf(decl_179, type, esk100_2: a > multiset_a > multiset_a). 0.19/0.53 thf(decl_180, type, esk101_2: a > multiset_a > multiset_a). 0.19/0.53 thf(decl_181, type, esk102_4: a > multiset_a > a > multiset_a > multiset_a). 0.19/0.53 thf(decl_182, type, esk103_1: (multiset_a > $o) > a). 0.19/0.53 thf(decl_183, type, esk104_1: (multiset_a > $o) > multiset_a). 0.19/0.53 thf(decl_184, type, esk105_1: (multiset_a > $o) > a). 0.19/0.53 thf(decl_185, type, esk106_1: (multiset_a > $o) > multiset_a). 0.19/0.53 thf(decl_186, type, esk107_1: multiset_a > a). 0.19/0.53 thf(decl_187, type, esk108_1: multiset_a > multiset_a). 0.19/0.53 thf(decl_188, type, esk109_1: (multiset_a > $o) > a). 0.19/0.53 thf(decl_189, type, esk110_1: (multiset_a > $o) > multiset_a). 0.19/0.53 thf(decl_190, type, esk111_1: (multiset_a > multiset_a > $o) > a). 0.19/0.53 thf(decl_191, type, esk112_1: (multiset_a > multiset_a > $o) > multiset_a). 0.19/0.53 thf(decl_192, type, esk113_1: (multiset_a > multiset_a > $o) > multiset_a). 0.19/0.53 thf(decl_193, type, esk114_1: (multiset_a > multiset_a > $o) > a). 0.19/0.53 thf(decl_194, type, esk115_1: (multiset_a > multiset_a > $o) > multiset_a). 0.19/0.53 thf(decl_195, type, esk116_1: (multiset_a > multiset_a > $o) > multiset_a). 0.19/0.53 thf(decl_196, type, esk117_1: multiset_a > a). 0.19/0.53 thf(decl_197, type, esk118_1: multiset_a > multiset_a). 0.19/0.53 thf(decl_198, type, esk119_1: multiset_a > a). 0.19/0.53 thf(decl_199, type, esk120_3: multiset_a > multiset_a > (multiset_a > $o) > a). 0.19/0.53 thf(decl_200, type, esk121_3: multiset_a > multiset_a > (multiset_a > $o) > multiset_a). 0.19/0.53 thf(decl_201, type, esk122_3: multiset_a > multiset_a > set_Product_prod_a_a > a). 0.19/0.53 thf(decl_202, type, esk123_3: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a). 0.19/0.53 thf(decl_203, type, esk124_3: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a). 0.19/0.53 thf(decl_204, type, esk125_6: multiset_a > a > multiset_a > multiset_a > multiset_a > set_Product_prod_a_a > a). 0.19/0.53 thf(decl_205, type, esk126_4: multiset_a > a > multiset_a > set_Product_prod_a_a > multiset_a). 0.19/0.53 thf(decl_206, type, esk127_4: multiset_a > a > multiset_a > set_Product_prod_a_a > multiset_a). 0.19/0.53 thf(decl_207, type, esk128_2: set_a > set_a > a). 0.19/0.53 thf(decl_208, type, esk129_3: multiset_a > multiset_a > set_Product_prod_a_a > a). 0.19/0.53 thf(decl_209, type, esk130_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.19/0.53 thf(decl_210, type, esk131_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.19/0.53 thf(decl_211, type, esk132_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.19/0.53 thf(decl_212, type, esk133_4: set_Product_prod_a_a > multiset_a > multiset_a > a > a). 0.19/0.53 thf(decl_213, type, esk134_1: multiset_multiset_a > multiset_a). 0.19/0.53 thf(decl_214, type, esk135_3: a > multiset_a > multiset_multiset_a > multiset_a). 0.19/0.53 thf(decl_215, type, esk136_3: multiset_a > (a > multiset_a) > (a > multiset_a) > a). 0.19/0.53 thf(decl_216, type, epred2_1: set_a > a > $o). 0.19/0.53 thf(fact_9__092_060open_062_092_060lbrakk_062_092_060not_062_Aval_A_IT_Av1_Al1_Ar1_J_A_092_060le_062_Av2_059_Ais__heap_Al1_059_Ais__heap_Ar1_059_Aset__val_A_IT_Av1_Al1_Ar1_J_Av2_A_061_AT_Av2_Al1_Ar1_092_060rbrakk_062_A_092_060Longrightarrow_062_Ais__heap_A_IsiftDown_A_Iset__val_A_IT_Av1_Al1_Ar1_J_Av2_J_J_092_060close_062, axiom, (~((ord_less_eq_a @ (val_a @ (t_a @ v1 @ l1 @ r1)) @ v2))=>((is_heap_a @ l1)=>((is_heap_a @ r1)=>(((t_a @ v2 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))=(t_a @ v2 @ l1 @ r1))=>(is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_9__092_060open_062_092_060lbrakk_062_092_060not_062_Aval_A_IT_Av1_Al1_Ar1_J_A_092_060le_062_Av2_059_Ais__heap_Al1_059_Ais__heap_Ar1_059_Aset__val_A_IT_Av1_Al1_Ar1_J_Av2_A_061_AT_Av2_Al1_Ar1_092_060rbrakk_062_A_092_060Longrightarrow_062_Ais__heap_A_IsiftDown_A_Iset__val_A_IT_Av1_Al1_Ar1_J_Av2_J_J_092_060close_062)). 0.19/0.53 thf(fact_16_left_Osimps, axiom, ![X3:a, X1:tree_a, X2:tree_a]:(((heapIm1140443833left_a @ (t_a @ X3 @ X1 @ X2))=(X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_16_left_Osimps)). 0.19/0.53 thf(fact_17_right_Osimps, axiom, ![X3:a, X1:tree_a, X2:tree_a]:(((heapIm1257206334ight_a @ (t_a @ X3 @ X1 @ X2))=(X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_17_right_Osimps)). 0.19/0.53 thf(fact_34_val_Osimps, axiom, ![X3:a, X40:tree_a, X41:tree_a]:(((val_a @ (t_a @ X3 @ X40 @ X41))=(X3))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_34_val_Osimps)). 0.19/0.53 thf(conj_0, conjecture, (is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ l1 @ r1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.19/0.53 thf(fact_11__092_060open_062l_A_061_AT_Av1_Al1_Ar1_092_060close_062, axiom, ((la)=(t_a @ v1 @ l1 @ r1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_11__092_060open_062l_A_061_AT_Av1_Al1_Ar1_092_060close_062)). 0.19/0.53 thf(fact_3__092_060open_062is__heap_Al1_092_060close_062, axiom, (is_heap_a @ l1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3__092_060open_062is__heap_Al1_092_060close_062)). 0.19/0.53 thf(fact_4__092_060open_062is__heap_Ar1_092_060close_062, axiom, (is_heap_a @ r1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_4__092_060open_062is__heap_Ar1_092_060close_062)). 0.19/0.53 thf(fact_13__C_K_C_I1_J, axiom, ((heapIm1091024090Down_a @ (t_a @ v2 @ l1 @ r1))=(t_a @ v3 @ l2 @ r2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_13__C_K_C_I1_J)). 0.19/0.53 thf(fact_2_False, axiom, ~((ord_less_eq_a @ v1 @ v2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_2_False)). 0.19/0.53 thf(c_0_10, plain, (~(ord_less_eq_a @ (val_a @ (t_a @ v1 @ l1 @ r1)) @ v2)=>((is_heap_a @ l1)=>((is_heap_a @ r1)=>(((t_a @ v2 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))=(t_a @ v2 @ l1 @ r1))=>(is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1))))))))), inference(fof_simplification,[status(thm)],[fact_9__092_060open_062_092_060lbrakk_062_092_060not_062_Aval_A_IT_Av1_Al1_Ar1_J_A_092_060le_062_Av2_059_Ais__heap_Al1_059_Ais__heap_Ar1_059_Aset__val_A_IT_Av1_Al1_Ar1_J_Av2_A_061_AT_Av2_Al1_Ar1_092_060rbrakk_062_A_092_060Longrightarrow_062_Ais__heap_A_IsiftDown_A_Iset__val_A_IT_Av1_Al1_Ar1_J_Av2_J_J_092_060close_062])). 0.19/0.53 thf(c_0_11, plain, ((ord_less_eq_a @ (val_a @ (t_a @ v1 @ l1 @ r1)) @ v2)|(~(is_heap_a @ l1)|(~(is_heap_a @ r1)|(((t_a @ v2 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))!=(t_a @ v2 @ l1 @ r1))|(is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1))))))))), inference(fof_nnf,[status(thm)],[c_0_10])). 0.19/0.53 thf(c_0_12, plain, ![X919:a, X920:tree_a, X921:tree_a]:(((heapIm1140443833left_a @ (t_a @ X919 @ X920 @ X921))=(X920))), inference(variable_rename,[status(thm)],[fact_16_left_Osimps])). 0.19/0.53 thf(c_0_13, plain, ![X922:a, X923:tree_a, X924:tree_a]:(((heapIm1257206334ight_a @ (t_a @ X922 @ X923 @ X924))=(X924))), inference(variable_rename,[status(thm)],[fact_17_right_Osimps])). 0.19/0.53 thf(c_0_14, plain, ![X1007:a, X1008:tree_a, X1009:tree_a]:(((val_a @ (t_a @ X1007 @ X1008 @ X1009))=(X1007))), inference(variable_rename,[status(thm)],[fact_34_val_Osimps])). 0.19/0.53 thf(c_0_15, negated_conjecture, ~(is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ l1 @ r1))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.19/0.53 thf(c_0_16, plain, ((ord_less_eq_a @ (val_a @ (t_a @ v1 @ l1 @ r1)) @ v2)|(is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))))|~((is_heap_a @ l1))|~((is_heap_a @ r1))|((t_a @ v2 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))!=(t_a @ v2 @ l1 @ r1))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.19/0.53 thf(c_0_17, plain, ((la)=(t_a @ v1 @ l1 @ r1)), inference(split_conjunct,[status(thm)],[fact_11__092_060open_062l_A_061_AT_Av1_Al1_Ar1_092_060close_062])). 0.19/0.53 thf(c_0_18, plain, (is_heap_a @ l1), inference(split_conjunct,[status(thm)],[fact_3__092_060open_062is__heap_Al1_092_060close_062])). 0.19/0.53 thf(c_0_19, plain, (is_heap_a @ r1), inference(split_conjunct,[status(thm)],[fact_4__092_060open_062is__heap_Ar1_092_060close_062])). 0.19/0.53 thf(c_0_20, plain, ![X3:a, X2:tree_a, X1:tree_a]:(((heapIm1140443833left_a @ (t_a @ X3 @ X1 @ X2))=(X1))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.19/0.53 thf(c_0_21, plain, ![X1:tree_a, X3:a, X2:tree_a]:(((heapIm1257206334ight_a @ (t_a @ X3 @ X1 @ X2))=(X2))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.19/0.53 thf(c_0_22, plain, ![X1:tree_a, X2:tree_a, X3:a]:(((val_a @ (t_a @ X3 @ X1 @ X2))=(X3))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.19/0.53 thf(c_0_23, negated_conjecture, ~((is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ l1 @ r1)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.19/0.53 thf(c_0_24, plain, ((heapIm1091024090Down_a @ (t_a @ v2 @ l1 @ r1))=(t_a @ v3 @ l2 @ r2)), inference(split_conjunct,[status(thm)],[fact_13__C_K_C_I1_J])). 0.19/0.53 thf(c_0_25, plain, ~(ord_less_eq_a @ v1 @ v2), inference(fof_simplification,[status(thm)],[fact_2_False])). 0.19/0.53 thf(c_0_26, plain, ((is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ (heapIm1140443833left_a @ la) @ (heapIm1257206334ight_a @ la))))|(ord_less_eq_a @ (val_a @ la) @ v2)|((t_a @ v2 @ (heapIm1140443833left_a @ la) @ (heapIm1257206334ight_a @ la))!=(t_a @ v2 @ l1 @ r1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17]), c_0_17]), c_0_17]), c_0_17]), c_0_17]), c_0_18]), c_0_19])])). 0.19/0.53 thf(c_0_27, plain, ((heapIm1140443833left_a @ la)=(l1)), inference(spm,[status(thm)],[c_0_20, c_0_17])). 0.19/0.53 thf(c_0_28, plain, ((heapIm1257206334ight_a @ la)=(r1)), inference(spm,[status(thm)],[c_0_21, c_0_17])). 0.19/0.53 thf(c_0_29, plain, ((val_a @ la)=(v1)), inference(spm,[status(thm)],[c_0_22, c_0_17])). 0.19/0.53 thf(c_0_30, negated_conjecture, ~((is_heap_a @ (t_a @ v3 @ l2 @ r2))), inference(rw,[status(thm)],[c_0_23, c_0_24])). 0.19/0.53 thf(c_0_31, plain, ~((ord_less_eq_a @ v1 @ v2)), inference(split_conjunct,[status(thm)],[c_0_25])). 0.19/0.53 thf(c_0_32, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_27]), c_0_28]), c_0_24]), c_0_29]), c_0_27]), c_0_28])]), c_0_30]), c_0_31]), ['proof']). 0.19/0.53 # SZS output end CNFRefutation 0.19/0.53 # Parsed axioms : 247 0.19/0.53 # Removed by relevancy pruning/SinE : 0 0.19/0.53 # Initial clauses : 452 0.19/0.53 # Removed in clause preprocessing : 82 0.19/0.53 # Initial clauses in saturation : 370 0.19/0.53 # Processed clauses : 505 0.19/0.53 # ...of these trivial : 7 0.19/0.53 # ...subsumed : 106 0.19/0.53 # ...remaining for further processing : 391 0.19/0.53 # Other redundant clauses eliminated : 41 0.19/0.53 # Clauses deleted for lack of memory : 0 0.19/0.53 # Backward-subsumed : 1 0.19/0.53 # Backward-rewritten : 9 0.19/0.53 # Generated clauses : 154 0.19/0.53 # ...of the previous two non-redundant : 126 0.19/0.53 # ...aggressively subsumed : 0 0.19/0.53 # Contextual simplify-reflections : 0 0.19/0.53 # Paramodulations : 84 0.19/0.53 # Factorizations : 0 0.19/0.53 # NegExts : 0 0.19/0.53 # Equation resolutions : 47 0.19/0.53 # Propositional unsat checks : 0 0.19/0.53 # Propositional check models : 0 0.19/0.53 # Propositional check unsatisfiable : 0 0.19/0.53 # Propositional clauses : 0 0.19/0.53 # Propositional clauses after purity: 0 0.19/0.53 # Propositional unsat core size : 0 0.19/0.53 # Propositional preprocessing time : 0.000 0.19/0.53 # Propositional encoding time : 0.000 0.19/0.53 # Propositional solver time : 0.000 0.19/0.53 # Success case prop preproc time : 0.000 0.19/0.53 # Success case prop encoding time : 0.000 0.19/0.53 # Success case prop solver time : 0.000 0.19/0.53 # Current number of processed clauses : 92 0.19/0.53 # Positive orientable unit clauses : 48 0.19/0.53 # Positive unorientable unit clauses: 0 0.19/0.53 # Negative unit clauses : 14 0.19/0.53 # Non-unit-clauses : 30 0.19/0.53 # Current number of unprocessed clauses: 230 0.19/0.53 # ...number of literals in the above : 627 0.19/0.53 # Current number of archived formulas : 0 0.19/0.53 # Current number of archived clauses : 267 0.19/0.53 # Clause-clause subsumption calls (NU) : 5962 0.19/0.53 # Rec. Clause-clause subsumption calls : 3476 0.19/0.53 # Non-unit clause-clause subsumptions : 116 0.19/0.53 # Unit Clause-clause subsumption calls : 303 0.19/0.53 # Rewrite failures with RHS unbound : 0 0.19/0.53 # BW rewrite match attempts : 29 0.19/0.53 # BW rewrite match successes : 7 0.19/0.53 # Condensation attempts : 505 0.19/0.53 # Condensation successes : 12 0.19/0.53 # Termbank termtop insertions : 39325 0.19/0.53 0.19/0.53 # ------------------------------------------------- 0.19/0.53 # User time : 0.064 s 0.19/0.53 # System time : 0.008 s 0.19/0.53 # Total time : 0.072 s 0.19/0.53 # Maximum resident set size: 3860 pages 0.19/0.53 0.19/0.53 # ------------------------------------------------- 0.19/0.53 # User time : 0.074 s 0.19/0.53 # System time : 0.010 s 0.19/0.53 # Total time : 0.084 s 0.19/0.53 # Maximum resident set size: 2180 pages 0.19/0.53 EOF